Local Search-based Hybrid Algorithms for Finding Golomb Rulers
نویسندگان
چکیده
منابع مشابه
Golomb Rulers
The Math Factor podcast posed the problem of finding the smallest number of inch marks on a 12 inch ruler so that one could still measure any integer length from 1 to 12. One needs only four additional marks besides 0 and 12; for example 1, 4, 7, 10 works. This entertaining problem lead to others during the next few minutes (you can listen at mathfactor.uark.edu/2005/10) and inspired us to look...
متن کاملOn Disjoint Golomb Rulers
A set {ai | 1 ≤ i ≤ k} of non-negative integers is a Golomb ruler if differences ai − aj , for any i 6= j, are all distinct. A set of I disjoint Golomb rulers (DGR) each being a J-subset of {1, 2, · · · , n} is called an (I, J, n) − DGR. Let H(I, J) be the least positive n such that there is an (I, J, n) − DGR. In this paper, we propose a series of conjectures on the constructions and structure...
متن کاملGenetic Algorithm Approach to the Search for Golomb Rulers
GOLOMB RULERS Stephen W. Soliday soliday@gar eld.ncat.edu Abdollah Homaifar homaifar@gar eld.ncat.edu Department of Electrical Engineering North Carolina A&T State University Greensboro, North Carolina 27411 Gary L. Lebby lebby@gar eld.ncat.edu Abstract The success of genetic algorithm in nding relatively good solutions to NP-complete problems such as the traveling salesman problem and job-shop...
متن کاملEvolving Golomb Rulers
A Golomb Ruler is defined as a ruler that has marks unevenly spaced at integer locations in such a way that the distance between any two marks is unique. Unlike usual rulers, they have the ability to measure more discrete measures than the number of marks they possess. Although the definition of a Golomb Ruler does not place any restriction on the length of the ruler, researchers are usually in...
متن کاملA Hybrid Algorithm using Firefly, Genetic, and Local Search Algorithms
In this paper, a hybrid multi-objective algorithm consisting of features of genetic and firefly algorithms is presented. The algorithm starts with a set of fireflies (particles) that are randomly distributed in the solution space; these particles converge to the optimal solution of the problem during the evolutionary stages. Then, a local search plan is presented and implemented for searching s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Constraints
سال: 2007
ISSN: 1383-7133,1572-9354
DOI: 10.1007/s10601-007-9020-1